Participation constraints of matching mechanisms

Inheritance under Participation Constraints

Traditional database systems have been successful in handling large amounts of data but lack mechanisms for schema derivations and schema veriication. In this paper, we propose (i) structures that carry expressive and useful information on the database schema, (ii) a set of inference rules for schema derivations, and (iii) a mechanism for discovering contradictory schema declarations. To this e...

Overcoming Participation Constraints

In incomplete information environments with transferable utility, efficient outcomes are generally implementable unless interim or ex post participation constraints are imposed on the problem. In this paper we show that linking a sufficiently large number of independent but possibly unrelated social decisions, a slightly perturbed Groves mechanism can implement an efficient outcome with probabi...

Reasoning about participation constraints and Chen's constraints

Matrix representations of participation constraints

We discuss the existence of matrix representations for generalized and minimum participation constraints which are frequently used in database design and conceptual modelling. Matrix representations, also known as Armstrong relations, have been studied in literature e.g. for functional dependencies and play an important role in example-based design and for the implication problem of database co...

Single-View Matching Constraints

A single-view matching constraint is described which represents a necessary condition which 6 points in an image must satisfy if they are the images of 6 known 3D points under an arbitrary projective transformation. Similar to the well-known matching constrains for two or more view, represented by fundamental matrices or trifocal tensors, single-view matching constrains are represented by tenso...